Maximizing edge-ratio is NP-complete
نویسندگان
چکیده
Given a graph G and a bipartition of its vertices, the edge-ratio is the minimum for both classes so defined of their number of internal edges divided by their number of cut edges. We prove that maximizing edgeratio is NP-complete.
منابع مشابه
Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs
In social networks the Strong Triadic Closure is an assignment of the edges with strong or weak labels such that any two vertices that have a common neighbor with a strong edge are adjacent. The problem of maximizing the number of strong edges that satisfy the strong triadic closure was recently shown to be NP-complete for general graphs. Here we initiate the study of graph classes for which th...
متن کاملMaximum Scatter TSP in Doubling Metrics
We study the problem of finding a tour of n points in which every edge is long. More precisely, we wish to find a tour that visits every point exactly once, maximizing the length of the shortest edge in the tour. The problem is known as Maximum Scatter TSP, and was introduced by Arkin et al. (SODA 1997), motivated by applications in manufacturing and medical imaging. Arkin et al. gave a 0.5 -ap...
متن کاملApproximating Clique and Biclique Problems
We present here 2-approximation algorithms for several node deletion and edge deletion biclique problems and for an edge deletion clique problem. The biclique problem is to find a node induced subgraph that is bipartite and complete. The objective is to minimize the total weight of nodes or edges deleted so that the remaining subgraph is bipartite complete. Several variants of the biclique prob...
متن کاملAn Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality
Consider a complete graph G with the edge weights satisfying the β-sharpened triangle inequality: weight(u, v) ≤ β(weight(u, x)+ weight(x, v)), for 1/2 ≤ β < 1. We study the NP-hard problem of finding a minimum weight spanning subgraph of G which is k-vertex-connected, k ≥ 2, and give a detailed analysis of an approximation quadratic-time algorithm whose performance ratio is β 1−β . The algorit...
متن کاملMaximizing the Cohesion is NP-hard
We show that the problem of finding a set with maximum cohesion in an undirected network is NP-hard. Key-words: social networks, complex networks, cohesion, np-complete, complexity in ria -0 06 21 06 5, v er si on 2 9 O ct 2 01 1 Maximiser la Cohésion est NP-dur Résumé : Nous montrons que le problème de trouver un ensemble de cohésion maximum dans un graphe non orienté est NP-dur. Mots-clés : r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 159 شماره
صفحات -
تاریخ انتشار 2011